Quantum indistinguishability: alternative constructions of the transported basis

نویسندگان

  • M. V. Berry
  • J. M. Robbins
  • M Robbins
چکیده

Our earlier arguments (Berry, M V & Robbins, J M 1997, Proc. Roy. Soc. Lond. A453 1771-1790) leading to the spin-statistics relation are summarized and then revisited. Constructions are described that satisfy all our previous requirements but lead to the wrong exchange sign (one such alternative is the replacement of commutators by anticommutators in the Schwinger representation of the spins of the particles); we suggest why these might be unacceptable. Short title: Quantum indistinguishability: alternative constructions Submitted to: J. Phys A. (Letters) March 2000 1

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Impact of the Spectral Filter Bandwidth on the Spectral Entanglement and Indistinguishability of Photon Pairs of SPDC Process

In this paper, we have investigated the dependence of the spectral entanglement and indistinguishability of photon pairs produced by the spontaneous parametric down-conversion (SPDC) procedure on the bandwidth of spectral filters used in the detection setup. The SPDC is a three-wave mixing process which occurs in a nonlinear crystal and generates entangled photon pairs and utilizes as one of th...

متن کامل

Perfect Structure on the Edge of Chaos - Trapdoor Permutations from Indistinguishability Obfuscation

We construct trapdoor permutations based on (sub-exponential) indistinguishability obfuscation and one-way functions, thereby providing the first candidate that is not based on the hardness of factoring. Our construction shows that even highly structured primitives, such as trapdoor permutations, can be potentially based on hardness assumptions with noisy structures such as those used in candid...

متن کامل

Perfect Structure on the Edge of Chaos

We construct trapdoor permutations based on (sub-exponential) indistinguishability obfuscation and oneway functions, thereby providing the first candidate that is not based on the hardness of factoring. Our construction shows that even highly structured primitives, such as trapdoor permutations, can be potentially based on hardness assumptions with noisy structures such as those used in candida...

متن کامل

Recent Results on Indistinguishability Obfuscation

In this research, the student will explain a candidate construction for indistinguishability obfuscation, based on a recent paper by Garg et al. (FOCS 2013). This is done by first describing the main building blocks, then how these are used to build indistinguishability obfuscation for NC, and expanded to P/poly. Security and alternative constructions are very briefly discussed.

متن کامل

Concrete Security Against Adversaries with Quantum Superposition Access to Encryption and Decryption Oracles

In 2013, Boneh and Zhandry introduced the notion of indistinguishability (IND) in chosen plaintext (CPA) and chosen ciphertext (CCA) attacks by a quantum adversary which is given superposition access to an oracle for encryption and decryption queries but is restricted to classical queries in the challenge phase. In this paper we define INDCPA and IND-CCA notions for symmetric encryption schemes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002